Minimization of Fixed-Polarity AND/XOR Canonical Networks
ثبت نشده
چکیده
A method to extract the cubes of the Generalized Reed-Muller form (GRM) of a Boolean function with a given polarity is presented. The method does not require exponential space and time complexity and it achieves the lower bound time complexity. The proof of the method’s correctness constitutes the first half of this paper. Also, a separate heuristic algorithm to find the optimal polarity that requires the least number of cubes in the GRM representation is proposed. The algorithm is fast and derives the polarity for variables and extracts all cubes simultaneously. It is based on the concept of a Boolean center for vertices, which emulates the center of gravity concept in geometry. The experimental results for the heuristic algorithm agree strongly with our observations and analysis.
منابع مشابه
Design For Testability Properties of AND/XOR Networks
AND XOR networks include all realizations of switching functions in two and multi level which in clude AND XOR and inverters as basic building blocks It has been shown that for many AND XOR canonical networks and trees the test set to detect stuck at faults and bridging faults are independent of the function being realized This paper provides a survey of these studies and introduces certain res...
متن کاملMultilevel Logic Minimization Using K-map XOR Patterns
OMBINING entered variable (EV) subfunctions and C XOR patterns in a Karnaugh map (K-map) extraction process [3] is a special and powerful form of K-map multilevel function minimization. Used with two-level logic forms (AND and OR functions) this multilevel minimization approach leads to XOIUSOP, EQVPOS and hybrid forms that often represent a substantial reduction in the hardware not possible ot...
متن کاملFixed Polarity Reed-muller Minimization of Incompletely Specified Boolean Functions Based on Information Estimations on Decision Trees
This paper presents algorithm to find minimal Fixed Polarity Reed-Muller expressions, twolevel fixed polarity AND-EXOR canonical representations, for incompletely specified Boolean functions that based on information measures on decision trees. We study the Free Reed-Muller Tree as acceptable representation and manipulation structure to find minimal Fixed Polarity Reed-Muller expressions. In co...
متن کاملEecient Synthesis of Anddxor Networks
|A new graph-based synthesis method for general Exclusive Sum-of-Product forms (ESOP) is presented in this paper. Previous research has largely concentrated on a class of ESOP's, the Canonical Restricted Fixed/Mixed Polarity Reed-Muller form, also known as Generalized Reed-Muller (GRM) form. However, for many functions, the minimum GRM can be much worse than the ESOP. We have de ned a Shared Mu...
متن کاملAlgorithms in computer-aided design of VLSI circuits
With the increased complexity of Very Large Scale Integrated (VLSI) circuits, Computer Aided Design (CAD) plays an even more important role. Top-down design methodology and layout of VLSI are reviewed. Moreover, previously published algorithms in CAD of VLSI design are outlined. In certain applications, Reed-Muller (RM) forms when implemented with AND/XOR or OR/XNOR logic have shown some attrac...
متن کامل